Search results for "adaptive algorithm"
showing 10 items of 21 documents
Learning vector quantization with alternative distance criteria
2003
An adaptive algorithm for training of a nearest neighbour (NN) classifier is developed in this paper. This learning rule has some similarity to the well-known LVQ method, but uses the nearest centroid neighbourhood concept to estimate optimal locations of the codebook vectors. The aim of this approach is to improve the performance of the standard LVQ algorithms when using a very small codebook. The behaviour of the learning technique proposed here is experimentally compared to those of the plain k-NN decision rule and the LVQ algorithms.
Robust adaptive algorithm with low computational cost
2006
An adaptive algorithm, which is robust to impulsive noise, is proposed. The cost function underlying this algorithm contains a parameter that controls the immunity to impulsive noise and can be easily adapted. Moreover, weight updating involves a nonlinear function, which recently has been shown to have an efficient hardware implementation. The proposed adaptive algorithm has been successfully tested in terms of accuracy and convergence on a system-identification simulation.
Impact of the erase algorithms on flash memory lifetime
2017
This paper presents a comparative study on the impact of the erase algorithm on flash memory lifetime, to demonstrate how the reduction of overall stress, suffered by memories, will increase their lifetime, thanks to a smart management of erase operations. To this purpose a fixed erase voltage, equal to the maximum value and the maximum time-window, was taken as the reference test; while an algorithm with adaptive voltage levels and the same overall time-window was designed and implemented in order to compare their experimental results. This study was carried out by using an innovative Automated Test Equipment, named Portable-ATE, tailored for Memory Test Chip and designed for performance e…
Grapham: Graphical models with adaptive random walk Metropolis algorithms
2008
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance according to the history of the chain and a Metropolis algorithm adjusting the proposal scale based on the observed acceptance probability. Different variants of the algorithms allow one, for example, to use these two algorithms together, employ delayed rejection and adjust several parameters of the algorithm…
An adaptive multimeme algorithm for designing HIV multidrug therapies.
2007
This paper proposes a period representation for modeling the multidrug HIV therapies and an Adaptive Multimeme Algorithm (AMmA) for designing the optimal therapy. The period representation offers benefits in terms of flexibility and reduction in dimensionality compared to the binary representation. The AMmA is a memetic algorithm which employs a list of three local searchers adaptively activated by an evolutionary framework. These local searchers, having different features according to the exploration logic and the pivot rule, have the role of exploring the decision space from different and complementary perspectives and, thus, assisting the standard evolutionary operators in the optimizati…
Finite-time Lyapunov dimension and hidden attractor of the Rabinovich system
2015
The Rabinovich system, describing the process of interaction between waves in plasma, is considered. It is shown that the Rabinovich system can exhibit a {hidden attractor} in the case of multistability as well as a classical {self-excited attractor}. The hidden attractor in this system can be localized by analytical-numerical methods based on the {continuation} and {perpetual points}. For numerical study of the attractors' dimension the concept of {finite-time Lyapunov dimension} is developed. A conjecture on the Lyapunov dimension of self-excited attractors and the notion of {exact Lyapunov dimension} are discussed. A comparative survey on the computation of the finite-time Lyapunov expon…
Steady-state and tracking analysis of a robust adaptive filter with low computational cost
2007
This paper analyses a new adaptive algorithm that is robust to impulse noise and has a low computational load [E. Soria, J.D. Martin, A.J. Serrano, J. Calpe, and J. Chambers, A new robust adaptive algorithm with low computacional cost, Electron. Lett. 42 (1) (2006) 60-62]. The algorithm is based on two premises: the use of the cost function often used in independent component analysis and a fuzzy modelling of the hyperbolic tangent function. The steady-state error and tracking capability of the algorithm are analysed using conservation methods [A. Sayed, Fundamentals of Adaptive Filtering, Wiley, New York, 2003], thus verifying the correspondence between theory and experimental results.
Adaptive motion estimation and video vector quantization based on spatiotemporal non-linearities of human perception
1997
The two main tasks of a video coding system are motion estimation and vector quantization of the signal. In this work a new splitting criterion to control the adaptive decomposition for the non-uniform optical flow estimation is exposed. Also, a novel bit allocation procedure is proposed for the quantization of the DCT transform of the video signal. These new approaches are founded on a perception model that reproduce the relative importance given by the human visual system to any location in the spatial frequency, temporal frequency and amplitude domain of the DCT transform. The experiments show that the proposed procedures behave better than their equivalent (fixed-block-size motion estim…
A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
2005
This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform extensive computational experiments with well-known instances previously reported, first to select the best alternatives and then to compare the efficiency of our algorithm with other procedures.
Network Capacity Estimators Predicting QoE in HTTP Adaptive Streaming
2022
The aim of adaptive HTTP streaming technology is preserving the best possible video streaming quality for viewers in heterogeneous network conditions. This can be achieved by making multiple quality versions of the video available. Switching between versions during playback should be imperceptible and fluent. The decision about quality-level switching is typically based on network capacity estimation and buffer occupancy, which predict the risk of stalling. Since quality-level switching and stalling are directly evident to the user, they are often classified as influence factors of quality of experience (QoE). In this paper, we observe different network capacity estimators and buffer behavi…